Using Stochastic-Dominance Relationships for Bounding Travel Times in Stochastic Networks
نویسندگان
چکیده
We consider stochastic networks in which link travel times are dependent, discrete random variables. We present methods for computing bounds on path travel times using stochastic dominance relationships among link travel times, and discuss techniques for controlling tightness of the bounds. We apply these methods to shortest-path problems, show that the proposed algorithm can provide bounds on the recommended path, and elaborate on extensions of the algorithm for demonstrating the anytime property.
منابع مشابه
A hybrid meta-heuristic algorithm for the vehicle routing problem with stochastic travel times considering the driver's satisfaction
A vehicle routing problem is a significant problem that has attracted great attention from researchers in recent years. The main objectives of the vehicle routing problem are to minimize the traveled distance, total traveling time, number of vehicles and cost function of transportation. Reducing these variables leads to decreasing the total cost and increasing the driver's satisfaction level. O...
متن کاملOptimal Path Problems with Second-Order Stochastic Dominance Constraints
This paper studies optimal path problems integrated with the concept of second order stochastic dominance. These problems arise from applications where travelers are concerned with the trade off between the risks associated with random travel time and other travel costs. Risk-averse behavior is embedded by requiring the random travel times on the optimal paths to stochastically dominate that on...
متن کاملAdvances in Applying Stochastic-Dominance Relationships to Bounding Probability Distributions in Bayesian Networks
Bounds of probability distributions are useful for many reasoning tasks, including resolving the qualitative ambiguities in qualitative probabilistic networks and searching the best path in stochastic transportation networks. This paper investigates a subclass of the state-space abstraction methods that are designed to approximately evaluate Bayesian networks. Taking advantage of particular sto...
متن کاملH∞ Sampled-Data Controller Design for Stochastic Genetic Regulatory Networks
Artificially regulating gene expression is an important step in developing new treatment for system-level disease such as cancer. In this paper, we propose a method to regulate gene expression based on sampled-data measurements of gene products concentrations. Inherent noisy behaviour of Gene regulatory networks are modeled with stochastic nonlinear differential equation. To synthesize feed...
متن کاملShortest path problem considering on-time arrival probability
This paper studies the problem of finding a priori shortest paths to guarantee a given likelihood of arriving on-time in a stochastic network. Such ‘‘reliable” paths help travelers better plan their trips to prepare for the risk of running late in the face of stochastic travel times. Optimal solutions to the problem can be obtained from local-reliable paths, which are a set of non-dominated pat...
متن کامل